Multiparty protocol that usually shuffles

Multiparty computation is raising importance because its primary objective to replace any trusted third party in the distributed computation. This work presents two multiparty shuffling protocols where each party, possesses a private input, agrees on random permutation while keeping secret. The proposed are based network, thereby data-oblivious. first proposal -permute that permutes inputs all possible ways. network consists of layers, and layer there gates. Our second protocol defines set , resultant . contains less number layers compare with network. Let would define layers. unconditionally secure against malicious adversary who can corrupt at most parties. probability learn outcome upper bound by Whereas, bounded for some positive integer recursive definition allow parties build quorums, distribute load among quorums.